The effective theory of Borel equivalence relations
نویسندگان
چکیده
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-Kechris-Louveau ([5]) show that with respect to Borel reducibility, any Borel equivalence relation strictly above equality on ω is above equality on P(ω), the power set of ω, and any Borel equivalence relation strictly above equality on the reals is above equality modulo finite on P(ω). In this article we examine the effective content of these and related results by studying effectively Borel equivalence relations under effectively Borel reducibility. The resulting structure is complex, even for equivalence relations with finitely many equivalence classes. However use of Kleene’s O as a parameter is sufficient to restore the picture from the noneffective setting. A key lemma is the existence of two effectively Borel sets of reals, neither of which contains the range of the other under any effectively Borel function; the proof of this result applies Barwise compactness to a deep theorem of Harrington (see [6]) establishing for any recursive ordinal α the existence of Π 1 singletons whose α-jumps are Turing incomparable.
منابع مشابه
Recursion Theory and Countable Borel Equivalence Relations
Recursion theory and countable Borel equivalence relations
متن کاملMartin’s Conjecture, Arithmetic Equivalence, and Countable Borel Equivalence Relations
There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin’s conjecture on Turing invariant functions. This longstanding open problem in recursion theory has connected to many problems in descriptive set theory, particularly in the theory of countable Borel equivalence relations. In this p...
متن کاملHow Many Turing Degrees are There ?
A Borel equivalence relation on a Polish space is countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in recursion theory are: recursive isomorphism, Turing equivalence, arithmetic equivalence, etc. There is a canonical hierarchy of complexity of countable Borel equivalence rel...
متن کاملDougherty And
A Borel equivalence relation on a Polish space is countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in recursion theory are: recursive isomorphism, Turing equivalence, arithmetic equivalence, etc. There is a canonical hierarchy of complexity of countable Borel equivalence rel...
متن کاملCountable Borel equivalence relations, Borel reducibility, and orbit equivalence
ing from the proof given above for Gaboriau-Popa we obtain theorems such as: Theorem 2.10 Let (X, d) be a complete, separable metric space equipped with an atomless Borel probability measure μ. Suppose Γ acts ergodically by measure preserving transformations on (X,μ) and the action on (X, d) is expansive. Let (Et)0<t<1 be a collection of distinct countable Borel equivalence relations on X with:...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 161 شماره
صفحات -
تاریخ انتشار 2010